Sharing of classes for modular programs in a multi-tenant environment

ABSTRACT

For each of a plurality of different tenants configured to concurrently execute in a virtual environment, a respective class loader graph can be constructed. For each respective class loader graph, unique types of edges between nodes that affect class loading can be identified. The edges can be traversed. Based on traversing the edges of the class loader graph, a respective unique dependency identifier (UDI) can be assigned to each class loader request. Class loader requests that are assigned the same UDI can be identified in at least two of the tenants. Responsive to identifying the class loader requests that are assigned the same UDI, a shared class loader can be assigned to each of the class loader requests. Each respective class loader request that is assigned the same UDI can be configured to call the shared class loader to load at least one class required by the respective tenant.

STATEMENT REGARDING PRIOR DISCLOSURES BY THE INVENTOR OR A JOINTINVENTOR

The following disclosures are submitted under 35 U.S.C. 102(b)(1)(A):

Tom Watson, Equinox Framework: A Happier OSGi R6 Implementation,EclipseCon 2014, San Francisco, Calif. (Mar. 18, 2014) (slidepresentation), and Tom Watson, How Dense is the Cloud of OSGI,EclipseCon 2014, San Francisco, Calif. (Mar. 20, 2014) (slidepresentation).

BACKGROUND

The present invention relates to the execution of workloads in avirtualized computing environment.

Heavily virtualized computing environments, for example cloud computingenvironments, are designed to realize cost savings by maximizing thenumber of workloads (e.g., programs) that are run per unit of hardware.This improves utilization rates of the hardware and energy efficiency byreducing, if not eliminating, idle time on hardware resources. Moreover,the total number of hardware resources deployed to handle the workloadsis less than the number which would otherwise be deployed without theuse of virtualization.

Workloads often times are written in Java™. Java™ is a general-purposeobject-oriented computer programming language specifically designed tohave as few implementation dependencies as possible. This allowsapplication developers to write applications that can be run on any JavaVirtual Machine (JVM), regardless of the computer architecture on whichthe applications are run. In this regard, a JVM provides an abstractionlayer between the actual hardware and Java™ applications, imitatingdedicated hardware. More particularly, a JVM interprets compiled Java™binary code, called bytecode, for a computer's processor so that theprocessor can execute the bytecode, even though the bytecode is notspecifically configured for the hardware on which it is executed. Thus,Java™ applications are portable, meaning that they can be executed onany type of computer architecture on which a JVM is executing.

SUMMARY

A method includes, for each of a plurality of different tenantsconfigured to concurrently execute in a virtual environment,constructing in memory of a processing system a respective class loadergraph including a plurality of nodes, each node representing arespective class loader request specified by a module of the tenant. Themethod also includes, for each respective class loader graph,identifying unique types of edges between nodes that affect classloading, wherein each edge extends from a respective first node to arespective second node and indicates a dependency of the class loaderrequest represented by the first node on the class loader requestrepresented by the second node, and traversing the edges in the classloader graph in accordance with data associated with each node. Based ontraversing the edges of the class loader graph, a unique dependencyidentifier can be assigned to each class loader request represented by acorresponding node. The respective unique dependency identifier assignedto a class loader request that is dependent on at least one other classloader request can be based, at least in part, on a respective type ofat least one edge extending from the first node representing the classloader request to the second node representing the other class loaderrequest. The method also includes identifying, in at least two of theplurality of tenants, class loader requests that are assigned the sameunique dependency identifier. The method also includes, responsive toidentifying the class loader requests that are assigned the same uniquedependency identifier, assigning, using a processor, a shared classloader to each of the class loader requests. The method also includesconfiguring each respective class loader request that is assigned thesame unique dependency identifier to call the shared class loader toload at least one class required by the respective tenant.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating example architecture for a systemthat hosts a multi-tenant virtual environment.

FIG. 2 is a block diagram illustrating example architecture for a dataprocessing system.

FIG. 3 is a pictorial representation of an example of a class loadergraph.

FIG. 4 is a flow chart illustrating an example of a method of sharing ofclasses for tenants executing in a multi-tenant virtual environment.

DETAILED DESCRIPTION

While the disclosure concludes with claims defining novel features, itis believed that the various features described herein will be betterunderstood from a consideration of the description in conjunction withthe drawings. The process(es), machine(s), manufacture(s) and anyvariations thereof described within this disclosure are provided forpurposes of illustration. Any specific structural and functional detailsdescribed are not to be interpreted as limiting, but merely as a basisfor the claims and as a representative basis for teaching one skilled inthe art to variously employ the features described in virtually anyappropriately detailed structure. Further, the terms and phrases usedwithin this disclosure are not intended to be limiting, but rather toprovide an understandable description of the features described.

The present invention relates to the execution of workloads in avirtualized computing environment. More particularly, arrangementsdescribed herein relate to sharing of classes for modular programs in amulti-tenant virtual environment. In accordance with the inventivearrangements disclosed herein, a shared class loader can be created orselected for use by a plurality of different computer programs, referredto as tenants, running concurrently in the same virtual environment(e.g., running on the same Java Virtual Machine). Using the shared classloader, a single copy of a class can be shared across multiple tenants,with each tenant having its own copy of writeable static fields. Theclasses that are shared can be classes loaded by a bootstrap andextension class loaders, middleware classes and application classes. Thesharing of classes improves resource utilization in a processing system.For example, memory is used more efficiently. Thus, less memory isrequired to store and execute program code. Moreover, startup time fortenants using shared classes is greatly improved.

In programs that use a complex and dynamic class loader hierarchy, suchas programs based on an Open Service Gateway initiative (OSGi)framework, implementing the sharing of classes is difficult. Thearrangements described herein overcome the technical challenges andextend the sharing of classes to such programs, thereby furtherextending resource utilization improvement in the processing system.

Several definitions that apply throughout this document now will bepresented.

As defined herein, the term “virtual environment” means a softwareexecution environment that is hosted by a virtual machine on at leastone processing system. One example of a virtual machine is a Java™Virtual Machine (JVM).

As defined herein, the term “multi-tenant environment” means a virtualenvironment in which a plurality of different tenants are concurrentlyhosted.

As defined herein, the term “tenant” means a modular program hosted in amulti-tenant environment that runs in the multi-tenant environmentconcurrently with, but independent of, one or more other modularprograms. In other words, two tenants hosted in a multi-tenantenvironment can be completely different applications or servicesunrelated to one another other than they are hosted in the samemulti-tenant environment and they may share classes and class loaders asdescribed herein.

As defined herein, the term “modular program” means a computer programcomprising a plurality of modules. An OSGi bundle is an example of amodule.

As defined herein, the term “bundle” means a set of one or more classes,class related resources, and services that give the class(es) specificbehaviors. For example, a bundle can be a Java Archive with extramanifest headers.

As defined herein, the term “class loader” means a software element thatdynamically loads a bundle of one or more classes into a virtual machinefor use by a computer program executing in a virtual environment.

As defined herein, the term “shared class loader” means a softwareelement that dynamically loads a bundle of one or more classes into avirtual machine for use by a plurality of computer programs executing ina virtual environment.

As defined herein, the term “class loader request” means program codeconfigured to be processed to send a request to a software component,such as an application program interface, to call a class loader to loadone or more classes.

As defined herein, the term “class loader graph” means a representation,constructed in memory of a processing system, of class loadingoperations performed to load into a virtual machine classes used by acomputer program. A class loader graph comprises a plurality of nodesassociated with and/or representing the class loading operations.

As defined herein, the term “edge” means a path from a node of a classloader graph directly to another node of the class loader graph.

As defined herein, the term “unique node identifier” means an identifierassigned to a node of a class loader graph that is unique, within theclass loader graph, to that node.

As defined herein, the term “unique dependency identifier” means anidentifier assigned to a node of a class loader graph that is determinedbased on one or more types of edges that terminate at the node. Aplurality of nodes of different class loader graphs can be assigned thesame unique dependency identifier.

As defined herein, the term “responsive to” means responding or reactingreadily to an action or event. Thus, if a second action is performed“responsive to” a first action, there is a causal relationship betweenan occurrence of the first action and an occurrence of the secondaction, and the term “responsive to” indicates such causal relationship.

As defined herein, the term “computer readable storage medium” means astorage medium that contains or stores program code for use by or inconnection with an instruction execution system, apparatus, or device.As defined herein, a “computer readable storage medium” is not atransitory, propagating signal per se.

As defined herein, the term “processor” means at least one hardwarecircuit (e.g., an integrated circuit) configured to carry outinstructions contained in program code. Examples of a processor include,but are not limited to, a central processing unit (CPU), an arrayprocessor, a vector processor, a digital signal processor (DSP), afield-programmable gate array (FPGA), a programmable logic array (PLA),an application specific integrated circuit (ASIC), programmable logiccircuitry, and a controller.

As defined herein, the term “automatically” means without userintervention.

FIG. 1 is a block diagram illustrating example architecture for a system100 that hosts a multi-tenant virtual environment. The architecture caninclude computer hardware 110, such as a data processing system. FIG. 2is a block diagram illustrating example architecture for the dataprocessing system 200. The data processing system 200 can include atleast one processor 205 (e.g., a central processing unit) coupled tomemory elements 210 through a system bus 215 or other suitablecircuitry. As such, the data processing system 200 can store programcode within the memory elements 210. The processor 205 can execute theprogram code accessed from the memory elements 210 via the system bus215. It should be appreciated that the data processing system 200 can beimplemented in the form of any system including a processor and memorythat is capable of performing the functions and/or operations describedwithin this specification. For example, the data processing system 200can be implemented as one or more hardware servers.

The memory elements 210 can include one or more physical memory devicessuch as, for example, local memory 220 and one or more bulk storagedevices 225. Local memory 220 refers to random access memory (RAM) orother non-persistent memory device(s) generally used during actualexecution of the program code. The bulk storage device(s) 225 can beimplemented as a hard disk drive (HDD), solid state drive (SSD), orother persistent data storage device. The data processing system 200also can include one or more cache memories (not shown) that providetemporary storage of at least some program code in order to reduce thenumber of times program code must be retrieved from the bulk storagedevice 225 during execution.

One or more network adapters 230 also can be coupled to data processingsystem 200 to enable the data processing system 200 to become coupled toother systems, computer systems, remote printers, and/or remote storagedevices through intervening private or public networks. Modems, cablemodems, transceivers, and Ethernet cards are examples of different typesof network adapters 230 that can be used with the data processing system400.

As pictured in FIG. 2, the memory elements 210 can store softwarecomponents 120, 130, 132, 134, 140, 142, 144, 150, 152 of the system 100of FIG. 1, which will be described. Being implemented in the form ofexecutable program code, these software components 120-152 of the system100 can be executed by the data processing system 200 and, as such, canbe considered part of the data processing system 200.

Referring again to FIG. 1, an operating system 120 can be installed on,and executed by, the computer hardware 110. A multi-tenant JVM 130 alsocan be installed on, and executed by the computer hardware 110. Moreparticularly, the multi-tenant JVM 130 can execute within a computingenvironment provided by the operating system 120. The multi-tenant JVM130 can include a JVM application program interface (API) 132. Themulti-tenant JVM 130 also can include a module registry 134 (e.g., abundle registry) which tracks loaded modules. In this regard, aplurality of tenants 140-1, 140-2, 140-n can be installed on, andexecuted by, the computer hardware 110. Specifically, the tenants 140can be executed by the multi-tenant JVM 130. The multi-tenant JVM 130can provide a layer of abstraction between the tenants 140 and thecomputer hardware 110. For example, the multi-tenant JVM 130 caninterpret compiled bytecode of the tenants 140 for the computer hardware110 so that the computer hardware 110 can execute the tenants 140, eventhough the tenants 140 may not be specifically configured to execute onthat particular computer hardware 110.

Each respective tenant 140-1, 140-2, 140-n can include a plurality ofmodules 142-1, 142-2, 142-n configured to perform certain operations ofthe tenant 140, thereby providing specific functionality for the tenant140. The modules 142 can be, for example, OSGi bundles. In this regard,an OSGi Framework, including an OSGi Framework API 152, can be installedon, and executed by, the computer hardware 110. Specifically, arespective instance 150-1, 150-2, 150-n of the OSGi framework can beinstantiated for each of the tenants 140-1, 140-2, 140-n. For example,each instance 150-1, 150-2, 150-n of the OSGi framework can run within arespective tenant 140-1, 140-2, 140-n. Each OSGi framework instance150-1, 150-2, 150-n can contain a class loader graph corresponding toits respective tenant 140-1, 140-2, 140-n.

As noted, each OSGi bundle includes a set of one or more classes, classrelated resources, and services that give the class(es) specificbehaviors when executed by the tenant 140. In addition to program code,each module 142 can include metadata that describes the capabilitiesprovided by the module 142 and capabilities required by the module 142.For example, each module 142 can indicate which classes (e.g., Javapackages) are required to fulfill dependencies needed in the module 142and indicate which classes contained in the module 142 will be madeavailable to other modules 142. These class dependencies andavailabilities for each tenant 140 are represented in a respective classloader graph. In illustration, the modules 142 can include class loaderrequests configured to, when processed, call class loaders 144 whichload classes required by the modules 142. When a particular module 142requires a class to be loaded, a class loader 144 can be dynamicallycreated for that module 142 to import certain packages containingclasses from one or more other modules 142, or access all packagescontaining classes exported by one or more other modules 142. The classloader 144 can import classes by sending a request to the JVM API 132,which in turn can send a corresponding request to the OSGi framework API152.

In accordance with the arrangements described herein, one or more classloaders 144, and the classes they load, can be shared across multipletenants 140. Thus, if a required class loader already exists, that classloader need not be re-created. In this regard, each shared class loader144 can be configured to be called by a plurality of the tenants 140 toload one or more classes that are required by the tenants 140. By way ofexample, a bundle object representing the shared class loader 144 can becreated, and this bundle object can be configured to be called bymodules 142 of different tenants 140 registered with the class loader144. The module registry 134 can track class loaders 144 which areassigned to be shared class loaders.

Permissions, resources and uniform resource locator (URL) handlers canbe assigned to the bundle object. For example, a shared class loader 144can be dynamically configured to return tenant specific values to eachof the tenants 140 registered with the shared class loader 144responsive to the shared class loader 144 being called to load classes.For example, responsive to a first tenant 140 calling the shared classloader 144, values generated by the called classes that are specific tothe first tenant 140 can be returned to the first tenant 140, but not toother tenants 140. Similarly, responsive to a second tenant 140 callingthe shared class loader 144, values generated by the called classes thatare specific to the second tenant 140 can be returned to the secondtenant 140, but not to other tenants 140. In this regard, each tenantcan have its own copy of writeable static fields for the classes thatare loaded.

In illustration, permissions (e.g., Java permissions) can be assigned toeach bundle 146 as the class(es) of the bundle 146 is/are being definedby the shared class loader 144, and the permissions can be associatedwith a protection domain. In this regard, protection domains used forthe shared class loader 144 can be multiplexed. In other words, morethan one protection domain can be assigned to the shared class loader144, and the shared class loader 144 can select which protection domainto implement when loading classes for a module 142 based on the tenant140 that is calling the class loader 144. For example, one set ofpermissions can be assigned to a class when it is accessed by a firsttenant 140, and another set of permissions can be assigned to the classwhen the class is accessed by another tenant 140.

Each package request generated by a module 142 can include a uniquedependency identifier (UDI) corresponding to a particular class loader144 that is required to load requested packages, as well as parametersrequired by the module 142 for that class loader 144. As noted, the JVMAPI 132 can process the request and send a corresponding request to theOSGi framework API 152. The OSGi framework API 152 can access the moduleregistry 134 to determine whether a class loader 144 assigned that UDIalready exists. If a class loader 144 assigned the UDI already exists(e.g., the class loader 144 already has been created for use by a module142 of another tenant 140, and that other tenant 140 has registered withthe class loader 144), the OSGi framework API 152 can register thetenant 140 with the existing class loader 144. Since more than onetenant 140 now is registered with the class loader 144, that classloader 144 can be considered a shared class loader 144 and the OSGiframework API 152 can create a bundle object for the class loader 144.If a class loader 144 assigned the UDI does not already exist, the OSGiframework API 152 can create the class loader 144, based on the requiredparameters, and assign the specified UDI to that class loader 144. Thus,other tenants 140 that provide a request including that same UDI can beregistered with the class loader 144, at which point the class loader144 will be considered a shared class loader 144.

The UDI assigned to a class loader 144 can be automatically generatedbased on an analysis of a class loader graph generated for a tenant 140calling the class loader 144. FIG. 3 is a pictorial representation of anexample of a class loader graph 300. The class loader graph 300 can beconstructed in the computer hardware 110, for example within the memoryelements 210 of FIG. 2. The class loader graph 300 can represent the useof class loaders 144 by the various modules 142 of the tenant 140. Asnoted, each tenant 140 can have its own instance 150 of the OSGiFramework which contains a class loader graph 300 for that tenant 140.

In this simple example, the class loaders 144 used by a particulartenant 140 are represented as nodes A, B, C, D and E. The tenant 140(e.g., the OSGi framework instance 150 for that tenant 140) can assignto each node A-E a unique node identifier (UNI). The UNI assigned toeach node is unique to that node in that particular class loader graph300 (i.e., unique with respect to a particular tenant 140). It isanticipated, however, that other tenants 140 may require one or moreclass loaders 144 that perform the same functionality of one or moreclass loaders 144 represented by the nodes A-E. Accordingly, one or morenodes in their respective class loader graphs may be assigned the sameUNI as one or more nodes in the class loader graph 300. For example, inone aspect, the UNI assigned to each respective node A-E can begenerated using a secure hash algorithm (SHA), such as a SHA-256, overthe bytes of data of the module (e.g., bundle) for which the classloader 144 is called. The UNI can be generated based on, not only thenumber of bytes of data used in the calculation, but also the manner inwhich those bytes of data are arranged. Thus, the UNI is assigned to aparticular ordered sequence of data, and is unique to that particularordered sequence. If another node in another class loader graph has thesame bytes of data, and those data bytes are arranged in the samemanner, that node will be assigned the same UNI. That being said, thepresent arrangements are not limited to the use of the SHA-256algorithm. Indeed, any other algorithm that generates a consistent UNIfor a given set of data bytes, and does not generate that same UNI for aset of data bytes having different values and/or a different sequence,may be used.

As noted, each module 142 can include metadata that describes thecapabilities provided by the module 142 and the capabilities required bythe module 142. The capabilities provided by each module 142 caninclude, for instance, an indication of classes exported by the module142. The capabilities required by each module 142 can include, forinstance, an indication of classes (e.g., one or more classes exportedby one or more other modules) that are expected to be used (e.g.,imported and/or accessed) by the module 142. Based on the metadata, theOSGi framework instance 150 for the respective tenant 140 can resolveinterdependencies among the class loaders 144 by creating, in the classloader graph 300, edges 302, 304, 306, 308, 310 representing theinterdependencies. Each edge can extend from a node to another node uponthat node depends. For example, edge 302 can extend from node B to nodeA, edge 304 can extend from node E to node B, etc. Further, each edge302-310 can be unique in the particular class loader graph 300. In thisregard, each edge 302-310 can indicate a type of operation that affectsclass loading for a respective the node B, D, E from which the edge302-310 extends. For example, in OSGi, an edge can indicate an operationrequiring a particular bundle, requiring a particular import package,requiring a particular fragment of a bundle, and so on. It should benoted that, as with the nodes A-E, one or more of the edges 302-310 maybe the same as edges representing interdependencies in class loadergraphs created for other tenants 140.

In some cases, there may a single edge between two respective nodes. Forexample, there may be a single edge 302 between nodes B and Arepresenting a single bundle requested by node B. In other cases, theremay be multiple edges between two respective nodes. For example, theremay be an edge 306 between nodes D and C representing a required importpackage and an edge 308 representing a required fragment. Moreover, aparticular node may be dependent on more than one other node. Hence, oneor more edges can extend from that node to each of the nodes on whichthe node is dependent. For example, if node E is dependent on nodes Band D, an edge 304 can extend from node E to node B, and an edge 310 canextend from node E to node D.

Based on the edges that extend from each node, the class loader 144represented by that node can be assigned a UDI, and thus the UDI can beassigned to the class loader request represented by that node. Forexample, the UDI can be assigned to the module 142 of the tenant 140that specifies the class loader request.

The UDI assigned to each node A-E can be generated by the tenant 140(e.g., the OSGi framework instance 150 for that tenant 140). Inillustration, the tenant 140 can traverse a path along edges 302-308 inthe class loader graph 300 that lead away from a respective node, andcalculate the UDI based on other nodes that are traversed following theedges 302-308, as well as the types of edges 302-310 that are traversed.For example, to generate a UDI for node B, the edge 302 extending fromnode B to node A can be traversed. Since node B is dependent on node A,and node A is not dependent on any other node, the UDI calculated fornode B can be calculated based on the UNI of node A and the type of theedge 302. For example, an SHA-256 algorithm can be applied to the UNIand bytes of data associated with the edge 302. The bytes of dataassociated with the edge 302 can include, for example, bytes of metadatathat defines the edge 302. Again, the present arrangements are notlimited to the use of the SHA-256 algorithm. Indeed, any other algorithmthat generates a consistent UDI for a given set of data bytes, and doesnot generate that same UDI for a set of data bytes having differentvalues and/or a different sequence, may be used.

To generate a UDI for node E, edge 304 can be traversed from node E toarrive at node B, and edge 302 can be traversed to arrive at node A.Further, edge 310 can be traversed from node E to arrive at node D, andedges 306, 308 can be traversed to arrive at node C. Based on the UNIassigned to each of the nodes A-D, to which the respective edges 302-310extend, and the edge type of each of the edges 302-310, the UDI for nodeE can be calculated.

Because class loaders 144 for nodes A and C do not depend from any otherclass loaders 144, the UDIs assigned to nodes A and C need only be basedon their respective UNIs.

The UDI assigned to each node D, E may be affected by the order in whichthe edges 302-310 are traversed. Thus, measures can be taken to ensurethat the order in which edges 302-310 are traversed for each tenant 140are consistent with the order in which edges are traversed for othertenants 140. Thus, the UDI assigned to the nodes of the class loadergraph 300 for each tenant 140 can be reliably compared to the UDIsassigned to the nodes of other tenants 140.

In one example, the edges can be traversed in an order indicated by themetadata associated within each node A-E. For example, the metadata caninclude a list of required packages, bundles, fragments, etc., and theedges 302-310 can be traversed in the order in which these objects arespecified.

In another example, the order in which the edges 302-310 are traversedcan be based on their edge types. For instance, in an arrangement inwhich a plurality of edges extend from a particular node, the edgesextending from that node can be sorted based on the type of each edge,and the UDI can be calculated for each node A-E by processing the bytesof data associated with each edge in the order in which the edges aresorted.

In another example, the edges can be traversed in a depth first order orin a breadth first order. In illustration, for a depth first order, edge304 can be traversed first, edge 302 can be traversed second, edge 310can be traversed third, edge 306 can be traversed fourth, and edge 308can be traversed fifth. For a breadth first order, edge 304 can betraversed first, edge 310 can be traversed second, edge 302 can betraversed third, edge 306 can be traversed fourth, and edge 308 can betraversed fifth.

At this point it should be noted that nodes which are dependent on aparticular node, and edges leading to the particular node from thedependent nodes, need not be considered when calculating the UDI forthat particular node. For example, when calculating the UDI for node B,only node A and edge 302 need be considered. Similarly, when calculatingthe UDI for node D, only node C and edges 306, 308 need be considered.Thus, if a class loader graph for another tenant 140 includes nodes A-D,but in lieu of, or in addition to, node E, that other class loader graphincludes some other node(s) as that depend on nodes B, D, the nodes inthat other class loader graph that correspond to nodes B, D can beassigned the same UDIs as nodes B, D, respectively. In this regard, thedetermination of whether a particular class loader 144 can be sharedamong multiple tenants 140 need not be dependent on what other classloaders 144 depend on that class loader 144, but instead can bedependent on the operations performed by that class loader 144 and otherclass loaders 144 on which the particular class loader 144 is dependent.

When a particular tenant 140 requires a class loader 144, the module 142calling the class loader 144 using a class loader request can indicatethe parameters of the class loader 144 and the UDI calculated for theclass loader 144. For example, when the tenant 140 for which the classloader graph 300 is created requires a class loader 144 represented bynode E, the module that calls the required class loader 144 can send aclass loader request (e.g., as a GetBundle request) to the JVM API 132.The class loader request can include the parameters of the class loader144 represented by node E, as well as the UDI assigned to node E. If aclass loader 144 assigned the same UDI has already been created, thetenant 140 can register with that class loader 144 and the class loader144 can be shared with the tenant 140. If a class loader 144 assignedthe same UDI has not already been created, that class loader 144 can becreated, and the tenant 140 can register with the class loader 144. Ifone or more other tenants 140 send a class loader request specifyingthat same UDI, rather than creating the class loader 144, the classloader 144 that has been created can be shared with such other tenant(s)140, and such tenant(s) 140 can register with the shared class loader144. Thus, if different tenants 140 require the same class loader 144,rather than recreating the class loader 144 for each tenant 140, oneclass loader 144 can be created and shared among the tenants 140 thatrequire that class loader 144. This greatly improves operatingefficiency of the processing system hosting the plurality of tenants140; less memory space is required to execute the plurality of tenants140, less processor resources are used since a fewer number of classloaders 144 are created, etc.

In one arrangement, rather than creating a class loader 144 the firsttime the class loader 144 is required during execution of a tenant 140,the class loaders 144 can be created ahead of time, for exampleresponsive to a class loader graph being resolved for a first tenant 140that requires that class loader 144. Moreover, if a class loader 144 iscreated for a first tenant 140, and a class loader graph is resolved foranother tenant 140 that requires the same class loader 144, the othertenant 140 can pre-register with the class loader 144 when resolving itsrespective class loader graph. For example, such operations can beperformed when the tenants 140 are installed. This mitigates the use ofprocessor resources to perform the class loader creation/registrationoperations when the tenants 140 are actually executing. If a tenant 140is uninstalled or reconfigured so that the tenant 140 no longer needsuse of a shared class loader 144, the tenant 140 can unregister itselfwith that class loader 144. The shared class loader 144 can bereconfigured accordingly.

Static initializers can be considered with respect the sharing of classloaders 144. When a class is loaded by a class loader 144, staticinitializers may perform other tasks. Such tasks can be limited to tasksthat are required by the particular tenant 140 for which the class isloaded. When another tenant accesses the class, however, the staticinitializers can again be run for that other tenant. In one arrangement,when a class is accessed by a tenant 140 using a shared class loader144, a notification can be communicated to all tenants 140pre-registered with the shared class loader 144 indicating that theclass has been accessed. Thus, the other tenants 140 are given notice torun the static initializers when the other tenants 140 call the sharedclass loader 144 to load the corresponding class.

FIG. 4 is a flow chart 400 illustrating an example of a method ofsharing of classes for tenants executing in a multi-tenant virtualenvironment. At step 402, for each of a plurality of different tenantsconfigured to concurrently execute in a virtual environment, arespective class loader graph can be constructed in memory of aprocessing system. Each class loader graph can comprise a plurality ofnodes, each node representing a respective class loader requestspecified by a module of the respective tenant. Each class loader graphcan be constructed by the respective tenant for which the class loaderrepresents class loading operations and/or by the OSGi framework.

At step 404, for each respective class loader graph, unique types ofedges between nodes that affect class loading can be identified. Eachedge can extend from a respective first node to a respective second nodeand indicate a dependency of the class loader request represented by thefirst node on the class loader request represented by the second node.The edges in the class loader can be traversed in accordance with data,for example metadata, associated with each node. Based on traversing theedges of the class loader graph, a respective UDI can be assigned toeach class loader request represented by a corresponding node. Therespective UDI assigned to a class loader request that is dependent onat least one other class loader request can be based, at least in part,on a respective type of at least one edge extending from the first noderepresenting the class loader request to the second node representingthe other class loader request. The respective UDIs assigned to a classloader request that is dependent on at least one other class loaderrequest also can be based on a UNI assigned to the second noderepresenting the other class loader request.

At step 406, class loader requests that are assigned the same UDI can beidentified in at least two of the plurality of tenants. Such classloader requests can be identified as the tenants are installed, or asthe tenants call the shared class loader, for example as previouslydescribed. At step 408, responsive to identifying the class loaderrequests that are assigned the same UDI, a shared class loader can beassigned to each of the class loader requests using a processor. At step410, each respective class loader request that is assigned the same UDIcan be configured to call the shared class loader to load at least oneclass required by the respective tenant.

For purposes of simplicity and clarity of illustration, elements shownin the figures have not necessarily been drawn to scale. For example,the dimensions of some of the elements may be exaggerated relative toother elements for clarity. Further, where considered appropriate,reference numbers are repeated among the figures to indicatecorresponding, analogous, or like features.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a,” “an,” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “includes,”“including,” “comprises,” and/or “comprising,” when used in thisdisclosure, specify the presence of stated features, integers, steps,operations, elements, and/or components, but do not preclude thepresence or addition of one or more other features, integers, steps,operations, elements, components, and/or groups thereof.

Reference throughout this disclosure to “one embodiment,” “anembodiment,” or similar language means that a particular feature,structure, or characteristic described in connection with the embodimentis included in at least one embodiment described within this disclosure.Thus, appearances of the phrases “in one embodiment,” “in anembodiment,” and similar language throughout this disclosure may, but donot necessarily, all refer to the same embodiment.

The term “plurality,” as used herein, is defined as two or more thantwo. The term “another,” as used herein, is defined as at least a secondor more. The term “coupled,” as used herein, is defined as connected,whether directly without any intervening elements or indirectly with oneor more intervening elements, unless otherwise indicated. Two elementsalso can be coupled mechanically, electrically, or communicativelylinked through a communication channel, pathway, network, or system. Theterm “and/or” as used herein refers to and encompasses any and allpossible combinations of one or more of the associated listed items. Itwill also be understood that, although the terms first, second, etc. maybe used herein to describe various elements, these elements should notbe limited by these terms, as these terms are only used to distinguishone element from another unless stated otherwise or the contextindicates otherwise.

The term “if” may be construed to mean “when” or “upon” or “in responseto determining” or “in response to detecting,” depending on the context.Similarly, the phrase “if it is determined” or “if [a stated conditionor event] is detected” may be construed to mean “upon determining” or“in response to determining” or “upon detecting [the stated condition orevent]” or “in response to detecting [the stated condition or event],”depending on the context.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A method comprising: for each of a plurality ofdifferent tenants configured to concurrently execute in a virtualenvironment, constructing in a memory of a processing system arespective class loader graph comprising a plurality of nodes, each noderepresenting a respective class loader request specified by a module ofthe tenant; for each respective class loader graph: identifying uniquetypes of edges between nodes that affect class loading, wherein eachedge extends from a respective first node to a respective second nodeand indicates a dependency of the class loader request represented bythe first node on the class loader request represented by the secondnode; traversing the edges in the class loader graph in accordance withdata associated with each node; and based on traversing the edges of theclass loader graph, assigning a unique dependency identifier to eachclass loader request represented by a corresponding node, wherein therespective unique dependency identifier assigned to a class loaderrequest that is dependent on at least one other class loader request isbased, at least in part, on a respective type of at least one edgeextending from the first node representing the class loader request tothe second node representing the other class loader request;identifying, in at least two of the plurality of tenants, class loaderrequests that are assigned the same unique dependency identifier;responsive to identifying the class loader requests to which the sameunique dependency identifier are assigned, assigning, using a processor,a shared class loader to each of the class loader requests; andconfiguring each respective class loader request to which the sameunique dependency identifier is assigned to call the shared class loaderto load at least one class required by the respective tenant.
 2. Themethod of claim 1, wherein the respective unique dependency identifierassigned to the class loader request that is dependent on at least oneother class loader request is based, at least in part, on a unique nodeidentifier assigned to the second node representing the other classloader request.
 3. The method of claim 1, wherein the tenant for whichthe respective class loader graph is constructed performs the steps ofconstructing in the memory of the processing system the respective classloader graph comprising the plurality of nodes, identifying unique typesof edges between nodes that affect class loading, traversing the edgesin the class loader graph in accordance with data associated with eachnode, and assigning to the class loader request, represented by thecorresponding node, the respective unique dependency identifier.
 4. Themethod of claim 1, further comprising: responsive to receiving the classloader request indicating the unique dependency identifier, determiningwhether a class loader to which the unique dependency identifier isassigned already exists; responsive to determining that the class loaderto which the unique dependency identifier is assigned already exists,assigning the class loader to be the shared class loader; andregistering the tenant for which the class loader request is generatedwith the shared class loader.
 5. The method of claim 1, furthercomprising: responsive to receiving a class loader request indicatingthe unique dependency identifier, determining whether a class loader towhich the unique dependency identifier is assigned already exists;responsive to determining that the class loader to which the uniquedependency identifier is assigned does not already exist, creating theclass loader and assigning to the class loader the unique dependencyidentifier; and registering the tenant for which the class loaderrequest is generated with the created class loader.
 6. The method ofclaim 1, wherein configuring each respective class loader request towhich the same unique dependency identifier is assigned to call theshared class loader to load at least one class required by therespective tenant comprises: pre-registering the respective tenant withthe shared class loader, the respective tenant pre-registering with theshared class loader prior to the shared class loader being called onbehalf of the respective tenant during execution of the respectivetenant.
 7. The method of claim 1, further comprising: dynamicallyconfiguring the shared class loader to, responsive to loading at leastone corresponding class, return tenant specific values generated by atleast one class loaded by the shared class loader to the tenant thatcalls the shared class loader.